Faster quantum number factoring via circuit synthesis
نویسندگان
چکیده
منابع مشابه
Faster Quantum Number Factoring via Circuit Synthesis
A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces o...
متن کاملPhoton-number squeezing in circuit quantum electrodynamics.
A superconducting single-electron transistor (SSET) coupled to an anharmonic oscillator, e.g., a Josephson junction-L-C circuit, can drive the latter to a nonequilibrium photon-number distribution. By biasing the SSET at the Josephson quasiparticle cycle, cooling of the oscillator as well as a laserlike enhancement of the photon number can be achieved. Here, we show that the cutoff in the quasi...
متن کاملFaster Factoring of Integers of a Special
A speedup of Lenstra's Elliptic Curve Method of factorization is presented. The speedup works for integers of the form N = P Q 2 , where P is a prime suuciently smaller than Q. The result is of interest to cryptographers, since integers with secret factorization of this form are being used in digital signatures. The algorithm makes use of what we call \Jacobi signatures". We believe these to be...
متن کاملOptimizing quantum optimization algorithms via faster quantum gradient computation
We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function f : Rd → R by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Jordan’s gradient calculation algorithm [Jor05], providing an approximation of the gradi...
متن کاملQuantum Ternary Circuit Synthesis Using Projection Operations
Basic logic gates and their operations in ternary quantum domain are involved in the synthesis of ternary quantum circuits. Only a few works define ternary algebra for ternary quantum logic realization. In this paper, a ternary logic function is expressed in terms of projection operations including a new one. A method to realize new multi-qutrit ternary gates in terms of generalized ternary gat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2013
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.87.012310